RED: Robust Earliest Deadline Scheduling
نویسندگان
چکیده
In this paper we introduce a robust earliest deadline scheduling algorithm for dealing with sporadic tasks under overloads in a hard real-time environment. The algorithm synergistically combines many features including a very important minimum level of guarantee, dynamic guarantees, graceful degradation in overloads, deadline tolerance, resource reclaiming, and dynamic re-guarantees. A necessary and su cient schedulability test is presented, and an e cient O(n) guarantee algorithm is proposed. The new algorithm is evaluated via simulation and compared to several baseline algorithms. The experimental results show excellent performance of the new algorithm in normal and overload conditions.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملEnabling Deadline Scheduling for Java Real-Time Computing
We present a scheduling architecture that enables the implementation of deadline-based scheduling policies. The architecture is used to give real-time capabilities to a custom Java virtual machine. This framework retains a clear separation between generic kernel mechanisms and upper level scheduling classes. A pure earliest deadline first algorithm can be implemented, but enhanced policies such...
متن کاملPreemptive uniprocessor scheduling for mixed-criticality systems
In this paper we implement the EDF-VD (Earliest Deadline First with Virtual Deadline) algorithm described in [1] for scheduling mixed-criticality, realtime task systems on preemptive uniprocessor platforms. We compare the scheduling overheads of this algorithm with the scheduling overheads of the well known EDF (Earliest Deadline First) algorithm for scheduling realtime task systems on preempti...
متن کاملMultiprocessor EDF and Deadline Monotonic Schedulability Analysis
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue -server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independe...
متن کاملDeveloping Robust Project Scheduling Methods for Uncertain Parameters
A common problem arising in project management is the fact that the baseline schedule is often disrupted during the project execution because of uncertain parameters. As a result, project managers are often unable to meet the deadline time of the milestones. Robust project scheduling is an effective approach in case of uncertainty. Upon adopting this approach, schedules are protected against po...
متن کامل